Abduction of trap invariants in parameterized systems

In a previous paper we have presented CEGAR approach for the verification of parameterized systems with an arbitrary number processes organized in array or ring. The technique is based on iterative computation invariants, i.e., infinite families invariants infinitely many instances system. Safety properties are proved by checking that every global configuration system satisfying all also satisfies property; shown this check can be reduced to satisfiability problem Monadic Second Order words, which decidable. A strong limitation only fixed variables finite range. particular, they cannot use range [0,N-1], where N processes, appear standard distributed algorithms. paper, extend our case. While conducting whether safety property inductive assuming computed set becomes undecidable, show how reduce it first-order formula. We report experiments showing automatic theorem provers still perform collection non-trivial examples. Additionally, give small sets readable these checks.